package io;
//递归练习：猴子吃桃
public class Recursion {
    public static void main(String[] args) {
        System.out.println(f(2));
    }
    public static int f(int n)
    {
       if(n==1)
       {

          return 1;
       }
       else {
        return f(n-1);
       }

    }

    public static int s(int n)
    {
       if (n==10)
       {
           return 1;}
       else {


        return  2*s(n+1)+2;
       }
    }
}
